Active Routing and Forwarding in Active IP Networks
نویسنده
چکیده
In this paper, we address the problem of active packet routing and forwarding in an active IP network involving both legacy IP routers and active capable routers. We first argue that any traditional routing scheme does not work well in active networks. We then give a formulation of a generalized active routing problem and propose an efficient routing scheme based on the formulation. The scheme is activedestination initiated, and is used for computing paths to a set of active destinations(servers). This selective approach allows the scheme to be seamlessly deployed onto any active IP network. We also present a labeling technique such that a label embedded in a packet can uniquely identify the expected ongoing services on the packet’s journey. With a forwarding table indexed by these labels, a simple and quick label lookup is sufficient to resolve any incoming active packet’s next hop.
منابع مشابه
Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
متن کاملForwarding Without Loops in Icarus
Packets trapped in a forwarding loop can rapidly saturate network links and disrupt communications until they are removed by the IP Time-To-Live (TTL) mechanism. This does not pose a significant problem when loops are rare, as is the case with mature routing protocols such as OSPF and BGP. However, in newer and more experimental settings, such as peer-to-peer overlays, active networks and multi...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملOn the Design of Next-Generation Routers and IP Networks
This thesis investigates distributed router architectures and IP networks with centralized control. While the current trend in IP-router architectures is towards decentralized design, there have also been research proposals for centralizing the control functions in IP networks. With continuous evolution of routers and IP networks, we believe that eventually IP networks in an autonomous system (...
متن کامل